Saliency Detection with VORONOI Diagram

نویسندگان

  • Dao Nam Anh
  • Nguyen Huu Quynh
چکیده

Many applications are serviced by the Voronoi tessellation required to split image into Voronoi regions. An automatic method to learn and detect salient region for color image with support of the Voronoi diagram is presented. Salient regions are modeled as flexible circumstance corresponding to centers of mass. The centers are predicted by local contrast-based representation with local maxima. Results are demonstrated that are very competitive with other recent saliency map detection schemes and show robustness to capture visual attention objects. Our major contributions are the local maxima based method for allocation of Voronoi centroids and the Gaussian-based filter for estimating attention degrees. To show the effectiveness of the approach, saliency maps are detected for images of MSRA saliency object database by some state-of-the-art methods. The strengths and the weaknesses of the approach are considered, with a special focus on the context based salient regions  a challenging task which can be found in wide range of applications addressed in computer vision. General Terms Pattern Recognition, Algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Interactive Tour of Voronoi Diagrams on the GPU

Voronoi diagrams are fundamental geometric structures that have been both deeply and widely investigated since their inception in disguise by René Descartes for analyzing the gravitational influence of stars, in the 17 century. Voronoi diagrams find countless applications in science and engineering beyond graphics as attested by the long representative, and yet non-exhaustive, list of applicati...

متن کامل

Image Stained Glass using Voronoi Diagrams

The geometrical concept of the Voronoi diagram was used to create an image filter providing a “stained glass” or mosaic effect on an image. The Voronoi diagram was calculated by exploiting its dual relationship with the Delaunay triangulation, which was in turn calculated using a randomized incremental algorithm and stored in a DCEL. Various methods were tried for selecting the points, includin...

متن کامل

Compact Voronoi Diagrams for Moving Convex Polygons

We describe a kinetic data structure for maintaining a compact Voronoi-like diagram of convex polygons moving around in the plane. We use a compact diagram for the polygons, dual to the Voronoi, first presented in [MKS96]. A key feature of this diagram is that its size is only a function of the number of polygons and not of their complexity. We demonstrate a local certifying property of that di...

متن کامل

Graph-based Visual Saliency Model using Background Color

Visual saliency is a cognitive psychology concept that makes some stimuli of a scene stand out relative to their neighbors and attract our attention. Computing visual saliency is a topic of recent interest. Here, we propose a graph-based method for saliency detection, which contains three stages: pre-processing, initial saliency detection and final saliency detection. The initial saliency map i...

متن کامل

Anomaly Detection with the Voronoi Diagram Evolutionary Algorithm

This paper presents the Voronoi diagram-based evolutionary algorithm (VorEAl). VorEAl partitions input space in abnormal/normal subsets using Voronoi diagrams. Diagrams are evolved using a multiobjective bio-inspired approach in order to conjointly optimize classification metrics while also being able to represent areas of the data space that are not present in the training dataset. As part of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015